Quantum Alice and silent Bob: Qubit-based Quantum Key Recycling with almost no classical communication
نویسندگان
چکیده
We answer an open question about Quantum Key Recycling (QKR): Is it possible to put the message entirely in qubits without increasing number of compared existing QKR schemes? show that this is indeed possible. introduce a prepare-and-measure protocol where communication from Alice Bob consists qubits. As usual, responds with authenticated one-bit accept/reject classical message. Compared Distribution (QKD), has reduced round complexity. previous qubit-based protocols, our scheme far less communication. provide security proof universal composability framework and find rate asymptotically same as for QKD one-way postprocessing.
منابع مشابه
Optimal attacks on qubit-based Quantum Key Recycling
Quantum Key Recycling (QKR) is a quantum-cryptographic primitive that allows one to re-use keys in an unconditionally secure way. By removing the need to repeatedly generate new keys it improves communication efficiency. Škorić and de Vries recently proposed a QKR scheme based on 8-state encoding (four bases). It does not require quantum computers for encryption/decryption but only single-qubit...
متن کاملQuantum Authentication with Key Recycling
We show that a family of quantum authentication protocols introduced in [Barnum et al., FOCS 2002] can be used to construct a secure quantum channel and additionally recycle all of the secret key if the message is successfully authenticated, and recycle part of the key if tampering is detected. We give a full security proof that constructs the secure channel given only insecure noisy channels a...
متن کاملQuantum Authentication and Encryption with Key Recycling
We propose an information-theoretically secure encryption scheme for classical messages with quantum ciphertexts that offers detection of eavesdropping attacks, and re-usability of the key in case no eavesdropping took place: the entire key can be securely re-used for encrypting new messages as long as no attack is detected. This is known to be impossible for fully classical schemes, where ther...
متن کاملQuantum Key Distribution with Qubit Pairs
We propose a new Quantum Key Distribution method in which Alice sends pairs of qubits to Bob; each is in one of four possible states. Bob uses one qubit to generate a secure key and the other to generate an auxiliary key. For each pair he randomly decides which qubit to use for which key. The auxiliary key has to be added to Bob’s secure key in order to match Alice’s secure key. This scheme pro...
متن کاملQuantum Key Recycling with eight-state encoding
Perfect encryption of quantum states using the Quantum One-Time Pad (QOTP) requires 2 classical key bits per qubit. Almost-perfect encryption, with information-theoretic security, requires only slightly more than 1. We slightly improve lower bounds on the key length. We show that key length n+2 log 1 ε suffices to encrypt n qubits in such a way that the cipherstate’s L1-distance from uniformity...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information & Computation
سال: 2021
ISSN: ['1533-7146']
DOI: https://doi.org/10.26421/qic21.1-2-1